Solving Customer-Driven Microgrid Optimization Problems as DCOPs
نویسندگان
چکیده
In response to the challenge by Ramchurn et al. to solve smart grid optimization problems with artificial intelligence techniques [21, 23], we investigate the feasibility of solving two common smart grid optimization problems as distributed constraint optimization problems (DCOPs). Specifically, we look at two common customer-driven microgrid (CDMG) optimization problems – a comprehensive CDMG optimization problem and an islanding problem. We show how one can model both problems as DCOPs and solve them using off-the-shelf DCOP algorithms, thus showing that researchers in the distributed constraint reasoning community are in a unique position to contribute towards this challenge.
منابع مشابه
Incremental DCOP Search Algorithms for Solving Dynamic DCOPs ∗ ( Extended
Distributed constraint optimization problems (DCOPs) are wellsuited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-s...
متن کاملIncremental DCOP search algorithms for solving dynamic DCOPs
Distributed constraint optimization problems (DCOPs) are wellsuited for modeling multi-agent coordination problems. However, most research has focused on developing algorithms for solving static DCOPs. In this paper, we model dynamic DCOPs as sequences of (static) DCOPs with changes from one DCOP to the next one in the sequence. We introduce the ReuseBounds procedure, which can be used by any-s...
متن کاملSolving dynamic constrained optimisation problems using repair methods
It has been shown that (i) dynamic constrained optimisation problems (DCOPs), a very common class of problems in real-world applications, have some special characteristics that make them very different from unconstrained dynamic problems and stationary constrained problems and (ii) some existing dynamic optimisation (DO) and constraint handling (CH) algorithms might not work effectively in solv...
متن کاملMetaheuristics for dynamic combinatorial optimization problems
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natu...
متن کاملSolving Distributed Constraint Optimization Problems Using Logic Programming
This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i) It shows how one can formulate DCOPs as logic programs; (ii) It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii) It experimentally shows that ASP-DPOP can be up to two orders of magnitude fas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013